On crossing-families in planar point sets
نویسندگان
چکیده
A $k$-crossing family in a point set $S$ general position is of $k$ segments spanned by points such that all mutually cross. In this short note we present two statements on crossing families which are based sets small cardinality: (1) Any at least 15 contains size 4. (2) There $n$ do not contain larger than $8\lceil \frac{n}{41} \rceil$. Both results improve the previously best known bounds.
منابع مشابه
New almost-planar crossing-critical graph families
We show that, for all choices of integers k > 2 and m, there are simple 3-connected k-crossing-critical graphs containing more than m vertices of each even degree ≤ 2k − 2. This construction answers one half of a question raised by Bokal, while the other half asking analogously about vertices of odd degrees at least 5 in crossing-critical graphs remains open. Furthermore, our constructed graphs...
متن کاملOn Universal Point Sets for Planar Graphs
A set P of points in R is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n 15. Conversely, we use a computer program to show that there exist universal point sets for all n 10 and to enumerate all corresponding order types. Finally, we describe a col...
متن کاملOn Point-Sets That Support Planar Graphs
Article history: Received 14 October 2011 Accepted 27 March 2012 Available online xxxx Communicated by D. Wagner
متن کاملA result on crossing families of odd sets
The following question is answered: given a crossing family F of odd subsets of an even-sized ground set V , what is the condition of the existence of a pairing M of the elements of V for which dM (X) = 1 for every X ∈ F? We show that the pairing exists if and only if F does not have a specific configuration of 4 sets. We present a consequence related to the conjecture of Woodall on dijoins.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry: Theory and Applications
سال: 2022
ISSN: ['0925-7721', '1879-081X']
DOI: https://doi.org/10.1016/j.comgeo.2022.101899